KERALA UNIVERSITY Class 4 data structures and algorithms Question Paper 2019

Practice authentic previous year questions for better exam preparation.

Sample Questions

Differentiate between linear and non-linear data structures.
An $n \times n$ square matrix $A$ is said to be symmetric if $A[j, k]=A[k, j]$ for all $j$ and $k$. Discuss on efficient way of storing a symmetric matrix in memory.
Convert the following infix expression to its equivalent prefix and postfix forms $$ A+(B * C-(D / E \uparrow F) * G) * H . $$
Write an algorithm to count the number of nodes in a binary tree.
Define the terms - complete graph and connected graph with examples.